Uniform Coloured Hypergraphs and Blocking Sets
نویسندگان
چکیده
In this paper some properties of k-chromatic and strong k-chromatic hypergraphs are proved. Conditions for the possible existence of blocking sets in Steiner systems are established. Mathematics Subject Classification: 05C15; 05B05
منابع مشابه
Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs
We prove the generalized Ramsey-type result on large 2-coloured matchings in a 3-coloured complete 3-uniform hypergraph, supporting a conjecture by A. Gyárfás.
متن کاملAPPROXIMATIONS TO m-COLOURED COMPLETE INFINITE HYPERGRAPHS
Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of the complete graph on N such that no complete infinite subgraph is exac...
متن کاملApproximations to m-Colored Complete Infinite Hypergraphs
Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of the complete graph on N such that no complete infinite subgraph is exac...
متن کاملNon-monochromatic non-rainbow colourings of σ-hypergraphs
One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin’s notion of colourings of mixed hypergraphs. In this paper we shall study a specific instance of Voloshin’s idea: a non-monochromatic non-rainbow (NMNR) colouring of a hypergraph is a colouring of its vertices such that every edge has at least two vertices coloured with different colo...
متن کاملAPPROXIMATIONS TO m-COLOURED COMPLETE INFINITE SUBGRAPHS
Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. In 1996, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of complete graph on N such that no complete infinite subgraph is exactly m-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013